Modeling of Time Geographical Kernel Density Function under Network Constraints
نویسندگان
چکیده
Time geography considers that the probability of moving objects distributed in an accessible transportation network is not always uniform, and therefore density function applied to quantitative time analysis needs consider actual constraints. Existing methods construct a kernel under constraints based on principle least effort each point shortest path between anchor points has same value. This, however, ignores attenuation effect with distance according first law geography. For this reason, article studies framework unity geography, it establishes mechanism for fusing extended traditional model point, thereby forming can approximate theoretical prototype Brownian bridge providing basis reducing uncertainty estimation space. Finally, empirical comparison taxi trajectory data shows proposed effective.
منابع مشابه
Modeling Network Growth under Resource Constraints
We propose a resource-constrained network growth model that explains the emergence of key structural properties of real-world directed networks: heavy-tailed indegree distribution, high local clustering and degree-clustering relationship. In real-world networks, individuals form edges under constraints of limited network access and partial information. However, well-known growth models that pre...
متن کاملDensity Estimation Under Constraints
We suggest a general method for tackling problems of density estimation under constraints. It is, in effect, a particular form of the weighted bootstrap, in which resampling weights are chosen so as to minimize distance from the empirical or uniform bootstrap distribution subject to the constraints being satisfied. A number of constraints are treated as examples. They include conditions on mome...
متن کاملTopological Constraints and Kernel-Based Density Estimation
This extended abstract1 explores the question of how to estimate a probability distribution from a finite number of samples when information about the topology of the support region of an underlying density is known. This workshop contribution is a continuation of our recent work [1] combining persistent homology and kernel-based density estimation for the first time and in which we explored an...
متن کاملVery Fast Kernel SVM under Budget Constraints
In this paper we propose a fast online Kernel SVM algorithm under tight budget constraints. We propose to split the input space using LVQ and train a Kernel SVM in each cluster. To allow for online training, we propose to limit the size of the support vector set of each cluster using different strategies. We show in the experiment that our algorithm is able to achieve high accuracy while having...
متن کاملL2-density estimation under constraints
In this paper, we are interested in non parametric density estimation under constraints. It generalises a previous paper which was devoted to density estimation with non-positive kernels. The resulting density approximation improves the estimation (by reducing the bias) but provides negative values. Therefore, we have proposed a projection method on the space of probability densities and an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISPRS international journal of geo-information
سال: 2022
ISSN: ['2220-9964']
DOI: https://doi.org/10.3390/ijgi11030184